Fleet Assignment with Time Windows, Spacing Constraints and Time Dependent Profits
نویسندگان
چکیده
Given the sets of flights and aircraft of an airline carrier, the fleet assignment problem consists in assigning the most profitable aircraft type to each flight. An extension to this problem is to allow for some flexibility on flight departure times. These time adjustments increase the number of possible connections and therefore improve the solution quality in terms of profits or in the reduction of the number of aircraft used to cover all flights. However some adjustments should be done with care. For instance, if the departure times of two flights serving the same origin-destination pair of cities become too close, passenger demands may be overestimated. Since passenger demands depend on departure times, flight profits may as well be inaccurate in case of a large flexibility. Therefore it is important to control not only the size of the time windows on flight departures but also the spacing out between flights serving the same O-D pair and the demand estimations.
منابع مشابه
A multi-criteria vehicle routing problem with soft time windows by simulated annealing
This paper presents a multi-criteria vehicle routing problem with soft time windows (VRPSTW) to mini-mize fleet cost, routes cost, and violation of soft time windows penalty. In this case, the fleet is heterogene-ous. The VRPSTW consists of a number of constraints in which vehicles are allowed to serve customers out of the desirable time window by a penalty. It is assumed that this relaxation a...
متن کاملA neighborhood search algorithm for the combined through and fleet assignment model with time windows
The fleet assignment model (FAM) for an airline assigns fleet types to a set of flight legs that satisfies a variety of constraints and minimizes the cost of the assignment. The through assignment model matches inbound flight legs into a city with the outbound flight legs at the same city that are flown by the same plane types and creates through connections (that is, flight connections with on...
متن کاملVehicle Routing with Time Windows and Customer Selection for Perishable Goods
Delivering perishable products to customers as soon as possible and with the minimum cost has been always a challenge for producers and has been emphasized over recent years due to the global market becoming more competitive. In this paper a multi-objective mix integer non-linear programming model is proposed to maximize both profits of a distributer and the total freshness of the several produ...
متن کاملAn Integrated Approach for Facility Location and Supply Vessel Planning with Time Windows
This paper presents a new model of two-echelon periodic supply vessel planning problem with time windows mix of facility location (PSVPTWMFL-2E) in an offshore oil and gas industry. The new mixed-integer nonlinear programming (MINLP) modelconsists ofa fleet composition problem and a location-routing problem (LRP). The aim of the model is to determine the size and type of large vessels in the fi...
متن کاملA Comparison of NSGA II and MOSA for Solving Multi-depots Time-dependent Vehicle Routing Problem with Heterogeneous Fleet
Time-dependent Vehicle Routing Problem is one of the most applicable but least-studied variants of routing and scheduling problems. In this paper, a novel mathematical formulation of time-dependent vehicle routing problems with heterogeneous fleet, hard time widows and multiple depots, is proposed. To deal with the traffic congestions, we also considered that the vehicles are not forced to come...
متن کامل